Memory performance of and-parallel prolog on shared-memory architectures

The goal of the RAP-WAM AND-parallel Prolog abstract architecture is to provide inference speeds significantly beyond those of sequential systems, while supporting Prolog semantics and preserving sequential performance and storage efficiency. This paper presents simulation results supporting these claims with special emphasis on memory performance on a two-level sharedmemory multiprocessor organization. Several solutions to the cache coherency problem are analyzed. It is shown that RAP-WAM offers good locality and storage efficiency and that it can effectively take advantage of broadcast caches. It is argued that speeds in excess of 2 ML IPS on real applications exhibiting medium parallelism can be attained with current technology

Design and analysis of a memory hierarchy for a very high performance multiprocessor configuration

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1982.MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING.Vita.Bibliography: p. 204-221.by Evan Michael Tick.M.S

Argonne National Laboratory Reports

This report comprises the abstracts and papers for the talks presented at the Workshop on Compilation of (Symbolic) Languages for Parallel Computers, held October 31 - November 1, 1991, in San Diego. These unrefereed contributions were provided by the participants for the purpose of this workshop; many of them will be published elsewhere in peer-reviewed conferences and publications

Optimizing Clause Matching Automata in Committed-Choice Languages

We introduce a formalism for clause matching in concurrent committed-choice languages based on the construction of clause matching automata, a heuristic for the compilation of clause matching, and a technique for more efficient implementation of matches. The formalism is notable for its generality and simplicity, the heuristic for combining important advantages of several existing heuristics. These include good typical-case time and space performance, a minimal number of suspensions, which can lead to tremendous efficiency benefits, and incremental restart after suspensions, which eliminates repeated tests. This paper presented at the First International Symposium on Parallel Symbolic Computation, Linz, Austria, September 1994. Department of Computer and Information Science University of Oregon Contents 1 Introduction 1 2 Background 1 3 Related Work 3 4 Clause Matching Automata 5 5 A Heuristic For Efficient CMA Construction 8 6 Disjuncts of Conjuncts 11 7 Conclusions 12 References 1..

Demand-Driven Dataflow for Concurrent Committed-Choice Code

Concurrent logic languages have been traditionally executed in a "greedy" fashion, such that computations are goal-driven. In contrast, non-strict functional programs have been traditionally executed in a "dataflow" fashion, such that computations are demand-driven. The latter method can be superior when allocation of resources such as memory is critical, which is usually the case for large, complex, and/or reactive programs. Specifically, demand-driven execution results in more efficient scheduling and improved termination properties. This paper describes a novel technique for demanddriven execution of concurrent logic language programs. This paper was submitted to International Conference on Parallel Architectures and Compilation Techniques, Montreal, August 1994. Department of Computer and Information Science University of Oregon Contents 1 Introduction 1 2 Demand-Driven Evaluation 3 3 Implementation Model 6 3.1 Objects Required by the Model : : : : : : : : : : : : : : : : : : ..

Finding Fair Allocations for the Coalition Problem with Constraints

Fair allocation of payoffs among cooperating players who can form various coalitions of differing utilities is the classic game theoretic “coalition problem.” Shapley’s value is perhaps the most famous fairness criterion. In this paper, a new allocation principle is proposed based on constraints. Initially constraints are defined by the coalition payoffs, in the standard way. The algorithm proceeds by “tightening ” the constraints in a fair manner until the solution space is sufficiently small. An arbitrary boundary point is then chosen as the “fair ” allocation. Our technique has been implemented in the constraint programming language CLP(R) and evaluated against Shapley values for various benchmark problems. We show how our method is related to Shapley values, some empirical tests and describe an application to bond swaps.

Mode Analysis of Arrays and Array Comprehensions

: A scheme is presented to enable the mode analysis of concurrent logic programs manipulating arrays containing both ground and non-ground elements. To do this we leverage constraint-propagation mode analysis techniques. The key ideas are to restrict multiple assignments only to variables at the leaves of paths, and to extend the language family with memo comprehensions. The result is a language not significantly different than generic committed-choice languages, which can be safely mode analyzed, producing useful (not overly conservative) information, even for programs that assign to unbound array elements. "Given for one instant an intelligence which could comprehend all the forces by which nature is animated and the respective positions of the beings which compose it, if moreover this intelligence were vast enough to submit these data to analysis...to it nothing would be uncertain..." Pierre Simon de Laplace Oeuvres, vol VII, Theorie Analytique des Probabilites 1 Introduction Mod..